representation of a digitized surface by triangular faces
نویسندگان
چکیده
this paper proposes a triangulation method for a digitized surface whose points are located on a regular lattice. the method relies on an iterative and adaptive splitting of triangular faces of an initial polyhedral surface. assuming a bijection between the digitized surface and its approximation, a partition of the data base is performed. the method allows the measurement of the local quality of the approximation and avoids the generation of triangles with sharp corners. its low computational complexity permits the approximation of very large sets of points.
منابع مشابه
Representation of a digitized surface by triangular faces
This paper proposes a triangulation method for a digitized surface whose points are located on a regular lattice. The method relies on an iterative and adaptive splitting of triangular faces of an initial polyhedral surface. Assuming a bijection between the digitized surface and its approximation, a partition of the data base is performed. The method allows the measurement of the local quality ...
متن کاملRepresentation of a digitized surface by triangular faces
This paper proposes a triangulation method for a digitized surface whose points are located on a regular lattice. The method relies on an iterative and adaptive splitting of triangular faces of an initial polyhedral surface. Assuming a bijection between the digitized surface and its approximation, a partition of the data base is performed. The method allows the measurement of the local quality ...
متن کاملRepresentation Learning by Rotating Your Faces
The large pose discrepancy between two face images is one of the fundamental challenges in automatic face recognition. Conventional approaches to pose-invariant face recognition either perform face frontalization on, or learn a pose-invariant representation from, a non-frontal face image. We argue that it is more desirable to perform both tasks jointly to allow them to leverage each other. To t...
متن کاملThe Triangular Theorem of Eight and Representation by Quadratic Polynomials
We investigate here the representability of integers as sums of triangular numbers, where the n-th triangular number is given by Tn = n(n + 1)/2. In particular, we show that f(x1, x2, . . . , xk) = b1Tx1 + · · · + bkTxk , for fixed positive integers b1, b2, . . . , bk, represents every nonnegative integer if and only if it represents 1, 2, 4, 5, and 8. Moreover, if ‘cross-terms’ are allowed in ...
متن کاملTriangular Bézier sub-surfaces on a triangular Bézier surface
This paper considers the problem of computing the Bézier representation for a triangular sub-patch on a triangular Bézier surface. The triangular sub-patch is defined as a composition of the triangular surface and a domain surface that is also a triangular Bézier patch. Based on de Casteljau recursions and shifting operators, previous methods express the control points of the triangular sub-pat...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
روش های عددی در مهندسی (استقلال)جلد ۱۵، شماره ۱، صفحات ۱-۱۰
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023